6.857 - Final Project Secure Transactions without Mining or Central Authority
نویسندگان
چکیده
In our project we implemented a system from transferring money without using Proof-of-Work, but consensus algorithms. First we implemented it using Paxos[11], that does not support Byzantine failures and needs a central authority to decide which nodes participate on the agreements. Then we reimplemented it using Stellar Consensus Protocol[2], that has no central authority and allows Byzantine nodes, given that Safety and Liveness assumptions are guarantee. The actual Stellar Network has many features that we did not implement for simplicity. While at Stellar Network anyone is allowed to be a gateway, entities that can create their own coins, our system has only one gateway. This way, there is no need to implement Distributed Exchange. Also, we only put one transaction on each slot of our ledger. This report is divided in 6 sections. Section 1 is this introduction. Section 2 gives an overview of existing models to implement a secure financial system with support to transactions. In section 3 we give an overview at Byzantine Agreements and Federated Byzantine Agreements. In section 4 we talk about how the Stellar Consensus Protocol works. Section 5 is about our implementation. Section 6 is the conclusion. We will not prove any theorem of these systems. We recommend looking at the references.
منابع مشابه
Secure data sharing in public cloud
Secure multi-party protocols have been proposed for entities (organizations or individuals) that don’t fully trust each other to share sensitive information. Many types of entities need to collect, analyze, and disseminate data rapidly and accurately, without exposing sensitive information to unauthorized or untrusted parties. Solutions based on secure multi-party computation guarantee privacy ...
متن کاملSecure Attribute-based Threshold Signature without a Trusted Central Authority
Currently, in most attribute-based cryptosystem, the central authority that distributes private keys for attributes assigned to the user must be trusted unconditionally otherwise the systems will soon be collapsed. To solve the problem we propose a new attributebased threshold signature scheme without a trusted central authority. When the number of user’s attributes reaches the threshold he can...
متن کاملResilient Cluster-Organizing Key Management and Secure Routing Protocol for Mobile Ad Hoc Networks
Unlike traditional networks, the characteristics of mobile wireless devices that can dynamically form a network without any infrastructure and wired line mean that mobile ad hoc networks frequently display partition owing to node mobility or link failures. Consequently, an ad hoc network is difficult to provide on-line access to trusted authorities or centralized servers. Despite the existence ...
متن کامل6.857 Computer & Network Security Final Project: Diierential Fault Analysis
Commercial ventures and nancial institutions have proposed and are relying upon smartcards and other security processors as a method for storing and transacting electronic currency. As users begin to accept electronic wallets as a viable option for storing their assets, the security community has placed these devices under closer scrutiny. The idea of using computational faults to break tamper ...
متن کاملEfficient and Secure Data Sharing By Applying AES Algorithm with Anonymous Id Assignment
Security is a basic requirement of an organization in the world to keep their information secure from their competitors. Various techniques and algorithms were developed by research in order to achieve secure data sharing. We propose a technique for anonymous sharing of private data between N parties is developed. This technique is used to allocate these node ID numbers ranging from 1 to N and ...
متن کامل